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:43wnwnScore: 3,392Success
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:443,37743,607,03826,972,0001,062,0002,486,272
2May 7, 2026 10:443,37845,656,95626,979,0001,066,0002,490,368
3May 7, 2026 10:443,38144,938,21727,004,0001,060,0002,498,560
4May 7, 2026 10:443,38542,849,94927,026,0001,077,0002,490,368
5May 7, 2026 10:443,39244,400,03627,093,0001,068,0002,486,272
6May 7, 2026 10:443,40044,274,17527,151,0001,069,0002,473,984
7May 7, 2026 10:443,40346,799,21027,179,0001,067,0002,482,176
8May 7, 2026 10:443,41046,604,46327,186,0001,121,0002,486,272
9May 7, 2026 10:443,42044,095,02927,316,0001,071,0002,486,272