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 listJan 3, 2026 02:57Josu San MartinJosu San MartinScore: 5,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 02:575,57573,868,68345,268,0001,005,0002,277,376
2Jan 3, 2026 02:575,63975,359,00044,811,0001,991,0002,355,200
3Jan 3, 2026 02:575,76277,430,48645,834,0001,992,0002,293,760
4Jan 3, 2026 02:575,77874,616,68846,959,000999,0002,269,184
5Jan 3, 2026 02:575,82673,683,66347,347,0001,007,0002,289,664
6Jan 3, 2026 02:576,02375,679,21948,988,000999,0002,293,760