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 2, 2026 17:15Josu San MartinJosu San MartinScore: 11,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 17:1511,009113,679,61789,365,0002,008,0002,465,792
2Jan 2, 2026 17:1511,197118,777,01890,940,0001,998,0002,363,392
3Jan 2, 2026 17:1511,198120,246,46091,943,000999,0002,465,792
4Jan 2, 2026 17:1511,223116,630,91992,152,0001,001,0002,281,472
5Jan 2, 2026 17:1511,355118,528,32092,238,0002,005,0002,281,472
6Jan 2, 2026 17:1511,368123,741,43192,349,0002,007,0002,359,296