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 31, 2026 13:22George SeabridgeGeorge SeabridgeScore: 41,129Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 13:2240,056342,467,236331,334,0001,136,0002,117,632
2Jul 31, 2026 13:2240,420345,495,903334,270,0001,216,0002,117,632
3Jul 31, 2026 13:2240,576346,797,666335,586,0001,203,0002,117,632
4Jul 31, 2026 13:2241,122351,361,845340,130,0001,190,0002,117,632
5Jul 31, 2026 13:2241,129351,382,290340,240,0001,133,0002,117,632
6Jul 31, 2026 13:2241,135351,525,353340,174,0001,249,0002,117,632
7Jul 31, 2026 13:2241,191352,131,201340,707,0001,182,0002,117,632
8Jul 31, 2026 13:2241,216352,415,443340,948,0001,153,0002,117,632
9Jul 31, 2026 13:2241,354353,172,212342,096,0001,144,0002,117,632