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 8, 2026 07:14flavio87flavio87Score: 9,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2026 07:149,45695,013,79377,468,0001,018,0002,338,816
2May 8, 2026 07:149,48794,914,99376,711,0002,032,0002,396,160
3May 8, 2026 07:149,52394,605,57177,009,0002,038,0002,392,064
4May 8, 2026 07:149,52893,245,71077,062,0002,026,0002,351,104
5May 8, 2026 07:149,53294,173,85877,088,0002,028,0002,367,488
6May 8, 2026 07:149,53993,740,82978,162,0001,018,0002,387,968
7May 8, 2026 07:149,62995,140,47777,892,0002,030,0002,379,776
8May 8, 2026 07:149,64595,556,16177,996,0002,059,0002,379,776
9May 8, 2026 07:149,66496,458,27479,190,0001,025,0002,334,720