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 6, 2026 10:06Teow Hua JunTeow Hua JunScore: 9,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 10:079,63689,410,09278,857,0001,125,0002,113,536
2Jul 6, 2026 10:079,64689,538,54878,860,0001,207,0002,113,536
3Jul 6, 2026 10:079,66789,664,28179,042,0001,199,0002,113,536
4Jul 6, 2026 10:079,66889,597,63179,046,0001,202,0002,113,536
5Jul 6, 2026 10:079,66889,631,13879,070,0001,178,0002,113,536
6Jul 6, 2026 10:079,68389,844,77479,361,0001,008,0002,113,536
7Jul 6, 2026 10:079,76190,335,80279,189,0001,832,00020,480
8Jul 6, 2026 10:079,80890,809,14679,830,0001,581,0002,113,536
9Jul 6, 2026 10:0710,41398,177,12183,240,0003,188,0002,117,632