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 listApr 18, 2026 12:04wnwnScore: 4,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 12:044,37658,777,98235,309,0001,008,0002,494,464
2Apr 18, 2026 12:044,38058,827,09635,342,0001,009,0002,494,464
3Apr 18, 2026 12:044,38256,914,59935,364,0001,010,0002,535,424
4Apr 18, 2026 12:044,39960,497,31635,501,0001,014,0002,486,272
5Apr 18, 2026 12:044,40259,476,92635,522,0001,014,0002,277,376
6Apr 18, 2026 12:044,41558,922,51235,628,0001,017,0002,531,328
7Apr 18, 2026 12:044,45062,238,25234,938,0001,996,0002,277,376
8Apr 18, 2026 12:044,49359,914,29736,283,0001,007,0002,490,368
9Apr 18, 2026 12:044,99563,285,18440,446,0001,011,0002,277,376