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 7, 2026 10:17wnwnScore: 3,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:173,38044,112,79027,002,0001,059,0002,490,368
2May 7, 2026 10:173,38342,389,34626,983,0001,098,0002,490,368
3May 7, 2026 10:173,38543,773,66127,005,0001,096,0002,469,888
4May 7, 2026 10:173,38842,701,44327,064,0001,063,0002,486,272
5May 7, 2026 10:173,39641,939,46327,098,0001,096,0002,473,984
6May 7, 2026 10:173,41842,610,14927,304,0001,068,0002,486,272
7May 7, 2026 10:173,42744,907,62027,371,0001,077,0002,478,080
8May 7, 2026 10:173,43143,458,38427,399,0001,081,0002,486,272
9May 7, 2026 10:173,43840,704,39827,469,0001,068,0002,486,272