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 13, 2026 17:43M-RochatM-RochatScore: 27,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:4327,035234,935,916223,349,0001,049,0002,113,536
2May 13, 2026 17:4327,037233,405,419223,387,0001,026,0002,113,536
3May 13, 2026 17:4327,038233,122,585223,403,0001,017,0002,113,536
4May 13, 2026 17:4327,040233,206,341223,414,0001,024,0002,113,536
5May 13, 2026 17:4327,055233,318,747223,487,0001,077,0002,113,536
6May 13, 2026 17:4327,123236,024,487224,105,0001,016,0002,113,536
7May 13, 2026 17:4327,546238,381,716227,578,0001,055,0002,113,536
8May 13, 2026 17:4327,874241,775,600230,341,0001,021,0002,113,536
9May 13, 2026 17:4327,900242,119,317230,549,0001,025,0002,113,536