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 31, 2026 21:40olliecrowolliecrowScore: 6,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 21:406,13973,651,35948,959,0001,998,0002,506,752
2Jan 31, 2026 21:406,14180,930,68546,971,0003,997,0002,416,640
3Jan 31, 2026 21:406,18975,078,45749,355,0002,014,0002,445,312
4Jan 31, 2026 21:406,43679,772,57551,403,0002,015,0002,277,376
5Jan 31, 2026 21:406,52482,746,31849,133,0005,013,0002,351,104
6Jan 31, 2026 21:406,53581,840,79451,230,0003,013,0002,510,848