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 16, 2026 08:11wnwnScore: 3,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 08:113,28735,361,86726,260,0001,023,0002,113,536
2Jul 16, 2026 08:113,30535,358,36826,389,0001,047,0002,113,536
3Jul 16, 2026 08:113,30835,509,79726,430,0001,031,0002,113,536
4Jul 16, 2026 08:113,31335,445,93426,446,0001,056,0002,113,536
5Jul 16, 2026 08:113,32635,558,59526,605,0001,008,0002,113,536
6Jul 16, 2026 08:113,33035,759,50726,626,0001,019,0002,113,536
7Jul 16, 2026 08:113,34435,871,44926,750,0001,012,0002,113,536
8Jul 16, 2026 08:113,44437,121,41727,566,0001,023,0002,113,536
9Jul 16, 2026 08:113,46936,709,17927,771,0001,029,0002,113,536