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 listMar 4, 2026 15:54caandocaandoScore: 5,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 15:545,28767,365,03641,888,0001,994,0002,277,376
2Mar 4, 2026 15:545,34771,762,65842,362,0002,017,0002,281,472
3Mar 4, 2026 15:545,36672,238,25542,511,0002,024,0002,281,472
4Mar 4, 2026 15:545,36967,557,73943,551,0001,012,0002,277,376
5Mar 4, 2026 15:545,40276,043,55243,843,000996,0002,273,280
6Mar 4, 2026 15:545,40376,037,11941,856,0002,989,0002,265,088