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 listSep 24, 2026 04:02wnwnScore: 3,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:023,36636,588,15526,910,0001,036,0002,113,536
2Sep 24, 2026 04:023,37236,788,65826,904,0001,091,0002,113,536
3Sep 24, 2026 04:023,39336,982,39027,145,0001,023,0002,113,536
4Sep 24, 2026 04:023,52738,656,65228,242,0001,033,0002,113,536
5Sep 24, 2026 04:023,54338,423,04328,403,0001,007,0002,113,536
6Sep 24, 2026 04:023,55238,310,02628,456,0001,033,0002,113,536
7Sep 24, 2026 04:023,55938,377,31128,543,0001,001,0002,113,536
8Sep 24, 2026 04:023,56038,328,56028,541,0001,008,0002,113,536
9Sep 24, 2026 04:023,60338,737,22028,885,0001,021,0002,113,536