Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 26, 2025 18:45T PrathamT PrathamScore: 34,517Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 18:4534,471306,254,560285,111,0001,000,0002,289,664
2May 26, 2025 18:4534,478311,221,570284,169,0002,001,0002,269,184
3May 26, 2025 18:4534,503308,859,264284,383,0001,995,0002,289,664
4May 26, 2025 18:4534,509315,504,405286,428,00002,289,664
5May 26, 2025 18:4534,517311,332,095285,492,0001,001,0002,269,184
6May 26, 2025 18:4534,518314,158,935285,499,0001,001,0002,289,664
7May 26, 2025 18:4534,521316,485,264285,524,000998,0002,289,664
8May 26, 2025 18:4534,529312,903,241284,592,0001,997,0002,289,664
9May 26, 2025 18:4534,539313,712,686284,677,0001,997,0002,289,664