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:41wnwnScore: 3,444Success
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:423,41845,516,55727,317,0001,054,0002,486,272
2May 7, 2026 10:423,41941,616,24527,324,0001,058,0002,490,368
3May 7, 2026 10:423,43545,447,66227,442,0001,069,0002,490,368
4May 7, 2026 10:423,43643,555,49527,445,0001,075,0002,482,176
5May 7, 2026 10:423,44444,243,15427,506,0001,080,0002,486,272
6May 7, 2026 10:423,46341,050,30527,633,0001,114,0002,473,984
7May 7, 2026 10:423,62646,391,20829,025,0001,075,0002,478,080
8May 7, 2026 10:423,64444,521,60929,161,0001,085,0002,478,080
9May 7, 2026 10:423,64746,050,28829,166,0001,110,0002,482,176