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 listJul 24, 2026 21:49boop34boop34Score: 9,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 21:508,96284,204,61273,176,0001,216,0002,113,536
2Jul 24, 2026 21:509,01284,573,34473,594,0001,208,0002,113,536
3Jul 24, 2026 21:509,02184,720,95473,748,0001,133,0002,113,536
4Jul 24, 2026 21:509,02286,264,86873,748,0001,138,0002,113,536
5Jul 24, 2026 21:509,03284,804,65273,839,0001,131,0002,113,536
6Jul 24, 2026 21:509,03284,830,00573,729,0001,242,0002,113,536
7Jul 24, 2026 21:509,04684,985,05873,880,0001,203,0002,113,536
8Jul 24, 2026 21:509,05784,921,04773,951,0001,228,0002,113,536
9Jul 24, 2026 21:509,27986,734,23875,883,0001,135,0002,113,536