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 5, 2026 14:02Teow Hua JunTeow Hua JunScore: 12,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:0312,212110,756,855100,224,0001,139,0002,113,536
2Jul 5, 2026 14:0312,213110,763,005100,237,0001,139,0002,113,536
3Jul 5, 2026 14:0312,214110,787,077100,214,0001,165,0002,113,536
4Jul 5, 2026 14:0312,215110,820,656100,246,0001,141,0002,113,536
5Jul 5, 2026 14:0312,216110,757,075100,244,0001,151,0002,113,536
6Jul 5, 2026 14:0312,219110,819,608100,267,0001,153,0002,117,632
7Jul 5, 2026 14:0312,224110,819,059100,314,0001,149,0002,117,632
8Jul 5, 2026 14:0312,225110,875,119100,322,0001,148,0002,113,536
9Jul 5, 2026 14:0312,239110,877,011100,581,0001,009,0002,113,536