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 listSep 6, 2026 10:46Kevin HeaveyKevin HeaveyScore: 3,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:493,53637,656,29928,130,0001,220,0002,113,536
2Sep 6, 2026 10:493,53637,654,86628,146,0001,210,0002,113,536
3Sep 6, 2026 10:493,54637,775,10728,390,0001,043,0002,113,536
4Sep 6, 2026 10:493,54737,723,30028,238,0001,209,0002,113,536
5Sep 6, 2026 10:493,55337,836,32928,299,0001,196,0002,113,536
6Sep 6, 2026 10:493,71139,083,99429,619,0001,190,0002,113,536
7Sep 6, 2026 10:493,75439,473,57929,938,0001,225,0002,113,536
8Sep 6, 2026 10:493,83940,181,25030,675,0001,189,0002,113,536
9Sep 6, 2026 10:493,84540,212,91630,704,0001,212,0002,113,536