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 14, 2026 21:26Kevin HeaveyKevin HeaveyScore: 3,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:273,87841,814,22631,173,0001,022,0002,117,632
2Jul 14, 2026 21:273,89041,945,71431,270,0001,022,0002,117,632
3Jul 14, 2026 21:273,90041,942,94731,356,0001,021,0002,117,632
4Jul 14, 2026 21:273,90141,972,37831,361,0001,022,0002,117,632
5Jul 14, 2026 21:273,90442,506,60731,382,0001,023,0002,117,632
6Jul 14, 2026 21:273,91142,109,71831,437,0001,025,0002,117,632
7Jul 14, 2026 21:273,91242,056,85131,451,0001,025,0002,117,632
8Jul 14, 2026 21:273,94242,364,96931,697,0001,027,0002,117,632
9Jul 14, 2026 21:273,94552,580,33731,723,0001,027,0002,121,728