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 17, 2026 14:40Kevin HeaveyKevin HeaveyScore: 3,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 14:593,66640,226,13229,406,0001,023,0002,113,536
2Jul 17, 2026 14:593,66640,276,02429,389,0001,047,0002,113,536
3Jul 17, 2026 14:593,67840,318,40329,485,0001,049,0002,113,536
4Jul 17, 2026 14:593,69540,501,20929,623,0001,050,0002,113,536
5Jul 17, 2026 14:593,69740,532,41729,641,0001,047,0002,113,536
6Jul 17, 2026 14:593,70240,559,14029,683,0001,046,0002,113,536
7Jul 17, 2026 14:593,71240,530,15929,771,0001,046,0002,113,536
8Jul 17, 2026 14:593,96042,716,08331,826,0001,042,0002,113,536
9Jul 17, 2026 14:593,97242,815,06631,925,0001,044,0002,113,536