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 10, 2026 09:48Josu San MartinJosu San MartinScore: 4,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 09:494,24149,358,56434,167,0001,038,0002,478,080
2May 10, 2026 09:494,24849,135,88334,226,0001,039,0002,486,272
3May 10, 2026 09:494,25150,845,23134,253,0001,038,0002,482,176
4May 10, 2026 09:494,25150,541,87134,247,0001,041,0002,494,464
5May 10, 2026 09:494,25553,520,14934,282,0001,039,0002,490,368
6May 10, 2026 09:494,26152,894,67734,332,0001,036,0002,482,176
7May 10, 2026 09:494,26252,634,62034,339,0001,039,0002,473,984
8May 10, 2026 09:494,26552,516,06634,363,0001,041,0002,486,272
9May 10, 2026 09:494,41164,251,47535,568,0001,045,0002,478,080