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 27, 2026 05:51wnwnScore: 3,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:523,42946,030,50327,449,0001,016,0002,469,888
2Apr 27, 2026 05:523,43941,919,23327,526,0001,019,0002,490,368
3Apr 27, 2026 05:523,45149,991,50727,625,0001,023,0002,490,368
4Apr 27, 2026 05:523,47442,127,10826,849,0001,988,0002,486,272
5Apr 27, 2026 05:523,48948,231,72226,966,0001,997,0002,490,368
6Apr 27, 2026 05:523,55851,363,77928,521,0001,018,0002,486,272
7Apr 27, 2026 05:523,59245,970,98527,827,0001,987,0002,482,176
8Apr 27, 2026 05:523,59342,522,60927,842,0001,988,0002,330,624
9Apr 27, 2026 05:523,60148,804,43227,897,0001,992,0002,490,368