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 7, 2026 09:54Kevin HeaveyKevin HeaveyScore: 7,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 09:587,85674,781,63062,783,0002,427,0002,117,632
2Jul 7, 2026 09:587,91475,270,28163,281,0002,408,0002,117,632
3Jul 7, 2026 09:587,91975,263,27763,433,0002,300,0002,117,632
4Jul 7, 2026 09:587,93475,451,81763,716,0002,137,0002,117,632
5Jul 7, 2026 09:587,95475,570,82063,715,0002,311,0002,117,632
6Jul 7, 2026 09:587,95675,574,29363,692,0002,349,0002,117,632
7Jul 7, 2026 09:587,97075,698,38763,654,0002,498,0002,117,632
8Jul 7, 2026 09:588,04176,282,99064,161,0002,587,0002,117,632
9Jul 7, 2026 09:588,14077,044,84565,108,0002,460,0002,117,632