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 14, 2026 10:19wnwnScore: 4,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 10:194,07462,155,46331,823,0001,988,0002,277,376
2Apr 14, 2026 10:024,12758,634,81132,236,0002,014,0002,277,376
3Apr 14, 2026 10:024,14153,658,93533,363,0001,011,0002,490,368
4Apr 14, 2026 10:194,22559,546,15833,067,0002,004,0002,277,376
5Apr 14, 2026 10:024,23360,422,27933,127,0002,007,0002,277,376
6Apr 14, 2026 10:194,26262,533,86634,363,0001,010,0002,498,560