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 8, 2026 06:48Victor MerckléVictor MerckléScore: 24,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 06:4924,715213,227,221204,138,0001,003,0002,117,632stderr
2Jul 8, 2026 06:4924,738213,403,686204,328,0001,002,0002,117,632stderr
3Jul 8, 2026 06:4924,742213,441,249204,362,0001,002,0002,117,632stderr
4Jul 8, 2026 06:4924,752213,583,099204,439,0001,004,0002,117,632stderr
5Jul 8, 2026 06:4924,810214,030,964204,922,0001,002,0002,117,632stderr
6Jul 8, 2026 06:4924,851214,298,622205,268,0001,002,0002,117,632stderr
7Jul 8, 2026 06:4924,920214,916,494205,834,0001,002,0002,117,632stderr
8Jul 8, 2026 06:4924,932220,080,519205,876,0001,061,0002,117,632stderr
9Jul 8, 2026 06:4925,118224,625,580207,415,0001,072,0002,117,632stderr