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 15, 2026 00:18boop34boop34Score: 16,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 00:1916,757149,016,803138,061,0001,027,0002,113,536
2Jul 15, 2026 00:1916,792149,352,729138,332,0001,044,0002,113,536
3Jul 15, 2026 00:1916,869150,254,176138,962,0001,054,0002,113,536
4Jul 15, 2026 00:1916,890150,424,459139,183,0001,004,0002,113,536
5Jul 15, 2026 00:1916,905150,228,557139,255,0001,064,0002,113,536
6Jul 15, 2026 00:1917,000150,813,006140,074,0001,027,0002,113,536
7Jul 15, 2026 00:1917,033151,069,645140,330,0001,045,0002,113,536
8Jul 15, 2026 00:1917,044151,080,388140,430,0001,042,0002,113,536
9Jul 15, 2026 00:1917,596156,286,223144,999,0001,054,0002,113,536