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 20, 2026 06:25M-RochatM-RochatScore: 54,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:2754,368474,995,568450,253,0001,004,0002,117,632
2May 20, 2026 06:2754,438473,667,157450,832,0001,004,0002,117,632
3May 20, 2026 06:2754,456462,003,521450,982,0001,003,0002,117,632
4May 20, 2026 06:2754,468464,672,467451,088,0001,004,0002,117,632
5May 20, 2026 06:2754,483475,001,005451,209,0001,006,0002,117,632
6May 20, 2026 06:2754,485463,216,606451,224,0001,004,0002,117,632
7May 20, 2026 06:2754,491462,756,062451,272,0001,005,0002,117,632
8May 20, 2026 06:2754,525472,692,113450,526,0002,039,0002,117,632
9May 20, 2026 06:2754,539478,040,514451,674,0001,003,0002,117,632