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 12, 2026 16:54Kevin HeaveyKevin HeaveyScore: 3,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 16:583,87641,814,15030,980,0001,193,0002,117,632
2Jul 12, 2026 16:583,87941,854,87331,014,0001,184,0002,117,632
3Jul 12, 2026 16:583,91242,102,47031,449,0001,023,0002,117,632
4Jul 12, 2026 16:583,91442,161,01231,465,0001,023,0002,117,632
5Jul 12, 2026 16:583,94442,507,68131,516,0001,225,0002,117,632
6Jul 12, 2026 16:583,94642,377,88031,558,0001,196,0002,117,632
7Jul 12, 2026 16:583,95642,508,59531,804,0001,037,0002,117,632
8Jul 12, 2026 16:583,97642,679,13631,967,0001,041,0002,117,632
9Jul 12, 2026 16:583,98742,785,61132,053,0001,043,0002,117,632