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 30, 2026 08:34Andrey TsvetkovAndrey TsvetkovScore: 41,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 08:3441,858374,041,200346,420,0001,001,0002,535,424
2Jan 30, 2026 08:3341,859373,355,461344,437,0002,995,0002,433,024
3Jan 30, 2026 08:3341,860375,824,776346,439,0001,001,0002,330,624
4Jan 30, 2026 08:3441,880372,835,620343,606,0003,995,0002,330,624
5Jan 30, 2026 08:3441,881373,238,657345,617,0001,997,0002,433,024
6Jan 30, 2026 08:3342,120387,951,443346,596,0002,996,0002,330,624