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 31, 2026 12:50George SeabridgeGeorge SeabridgeScore: 55,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 12:5055,160468,007,943456,676,0001,158,0002,117,632
2Jul 31, 2026 12:5055,160468,594,341456,668,0001,166,0002,117,632
3Jul 31, 2026 12:5055,166467,907,704456,737,0001,147,0002,117,632
4Jul 31, 2026 12:5055,177468,054,768456,778,0001,199,0002,117,632
5Jul 31, 2026 12:5055,188468,032,445456,929,0001,138,0002,117,632
6Jul 31, 2026 12:5055,206469,487,722457,075,0001,135,0002,117,632
7Jul 31, 2026 12:5055,214468,251,845457,155,0001,126,0002,117,632
8Jul 31, 2026 12:5055,234468,420,784457,279,0001,165,0002,117,632
9Jul 31, 2026 12:5055,285468,879,771457,745,0001,126,0002,117,632