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 13:39Teow Hua JunTeow Hua JunScore: 12,618Success
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 13:4012,605114,026,474103,595,0001,033,0002,117,632
2Jul 5, 2026 13:4012,607114,105,516103,593,0001,046,0002,117,632
3Jul 5, 2026 13:4012,609114,045,676103,638,0001,021,0002,117,632
4Jul 5, 2026 13:4012,613114,221,538103,635,0001,061,0002,117,632
5Jul 5, 2026 13:4012,618114,124,471103,705,0001,027,0002,117,632
6Jul 5, 2026 13:4012,622114,167,634103,735,0001,035,0002,117,632
7Jul 5, 2026 13:4012,623114,185,544103,750,0001,024,0002,117,632
8Jul 5, 2026 13:4012,624114,177,286103,730,0001,057,0002,117,632
9Jul 5, 2026 13:4013,121118,344,156107,879,0001,032,0002,117,632