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 6, 2026 14:52Kevin HeaveyKevin HeaveyScore: 6,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 14:566,59764,285,68353,586,0001,172,0002,117,632
2Jul 6, 2026 14:566,62464,449,45453,726,0001,258,0002,117,632
3Jul 6, 2026 14:566,63064,586,33853,762,0001,274,0002,117,632
4Jul 6, 2026 14:566,63664,566,87153,904,0001,180,0002,117,632
5Jul 6, 2026 14:566,64364,624,74854,007,0001,138,0002,117,632
6Jul 6, 2026 14:566,64364,624,06553,890,0001,251,0002,117,632
7Jul 6, 2026 14:566,64864,705,13153,957,0001,225,0002,117,632
8Jul 6, 2026 14:566,65164,692,56254,074,0001,135,0002,117,632
9Jul 6, 2026 14:566,65964,867,05854,038,0001,235,0002,117,632