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 18, 2026 16:41Kevin HeaveyKevin HeaveyScore: 3,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 16:563,69040,390,44929,585,0001,048,0002,113,536
2Jul 18, 2026 16:563,77142,481,73830,258,0001,046,0002,113,536
3Jul 18, 2026 16:563,79241,282,78630,430,0001,050,0002,113,536
4Jul 18, 2026 16:563,88342,061,52331,187,0001,048,0002,113,536
5Jul 18, 2026 16:563,89143,693,16531,252,0001,047,0002,113,536
6Jul 18, 2026 16:563,92542,381,15431,539,0001,045,0002,113,536
7Jul 18, 2026 16:564,00643,109,64632,207,0001,044,0002,113,536
8Jul 18, 2026 16:564,01043,120,08532,264,0001,024,0002,113,536
9Jul 18, 2026 16:564,02444,704,45832,359,0001,046,0002,113,536