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 25, 2026 21:22Maya RebholzMaya RebholzScore: 5,266Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 21:225,15154,378,40337,197,0005,559,0002,113,536
2May 25, 2026 21:225,16753,390,04937,479,0005,410,0002,113,536
3May 25, 2026 21:225,19355,747,77437,501,0005,602,0002,117,632
4May 25, 2026 21:225,26055,767,75238,147,0005,511,0002,113,536
5May 25, 2026 21:225,26656,042,00838,004,0005,710,0002,117,632
6May 25, 2026 21:225,28354,955,23838,162,0005,691,0002,117,632
7May 25, 2026 21:225,28454,083,82538,273,0005,585,0002,117,632
8May 25, 2026 21:225,47855,655,94040,174,0005,301,0002,117,632
9May 25, 2026 21:225,53156,257,34940,359,0005,551,0002,113,536