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 4, 2026 00:31Josu San MartinJosu San MartinScore: 6,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:316,04059,391,71046,912,0003,223,0002,113,536
2Jul 4, 2026 00:316,07159,677,87547,162,0003,232,0002,113,536
3Jul 4, 2026 00:316,08759,904,25547,447,0003,076,0002,113,536
4Jul 4, 2026 00:316,10060,018,70047,449,0003,184,0002,113,536
5Jul 4, 2026 00:316,18660,660,72548,073,0003,271,0002,113,536
6Jul 4, 2026 00:316,20560,993,98148,274,0003,233,0002,113,536
7Jul 4, 2026 00:316,20861,027,61048,271,0003,263,0002,113,536
8Jul 4, 2026 00:316,20960,988,06348,287,0003,255,0002,113,536
9Jul 4, 2026 00:316,31261,821,91949,313,0003,083,0002,113,536