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 09:59wnwnScore: 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:003,39243,716,35627,096,0001,064,0002,486,272
2May 7, 2026 10:003,40242,567,40327,169,0001,069,0002,486,272
3May 7, 2026 10:003,42145,953,85027,267,0001,129,0002,494,464
4May 7, 2026 10:003,42345,692,13527,302,0001,109,0002,490,368
5May 7, 2026 10:003,44442,696,58227,471,0001,118,0002,473,984
6May 7, 2026 10:003,56344,821,26128,481,0001,092,0002,486,272
7May 7, 2026 10:003,56546,135,70628,517,0001,074,0002,494,464
8May 7, 2026 10:003,58045,943,23028,648,0001,069,0002,490,368
9May 7, 2026 10:003,61147,499,92728,845,0001,130,0002,486,272