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 10, 2026 09:09wnwnScore: 3,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 09:103,35335,792,93926,801,0001,035,0002,113,536
2Jul 10, 2026 09:103,36235,917,96726,902,0001,004,0002,113,536
3Jul 10, 2026 09:103,37635,834,85426,985,0001,037,0002,113,536
4Jul 10, 2026 09:103,38336,014,67527,026,0001,059,0002,113,536
5Jul 10, 2026 09:103,39436,024,83927,170,0001,004,0002,113,536
6Jul 10, 2026 09:103,39736,090,31327,173,0001,024,0002,113,536
7Jul 10, 2026 09:103,49336,902,47927,972,0001,028,0002,113,536
8Jul 10, 2026 09:103,52637,261,79728,248,0001,018,0002,113,536
9Jul 10, 2026 09:103,53837,886,22328,342,0001,030,0002,113,536