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 9, 2026 17:54boop34boop34Score: 99,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 17:5599,317834,123,236823,337,0001,002,0002,113,536
2Jul 9, 2026 17:5599,324834,116,619823,393,0001,001,0002,113,536
3Jul 9, 2026 17:5599,329834,748,321822,411,0002,020,0002,113,536
4Jul 9, 2026 17:5599,329834,111,811823,432,0001,001,0002,113,536
5Jul 9, 2026 17:5599,329834,104,114823,433,0001,001,0002,113,536
6Jul 9, 2026 17:5599,345834,307,302823,567,0001,002,0002,113,536
7Jul 9, 2026 17:5599,350835,041,024822,562,0002,046,0002,113,536
8Jul 9, 2026 17:5599,374834,690,184822,770,0002,038,0002,113,536
9Jul 9, 2026 17:5599,376834,526,545822,797,0002,031,0002,113,536