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 listFeb 2, 2026 22:45javivallejojavivallejoScore: 38,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 22:4538,870346,808,928320,624,0001,997,0002,281,472
2Feb 2, 2026 22:4538,878348,599,502321,686,0001,002,0002,277,376
3Feb 2, 2026 22:4538,883343,748,215320,735,0001,998,0002,486,272
4Feb 2, 2026 22:4538,893346,077,675320,811,0001,998,0002,277,376
5Feb 2, 2026 22:4538,893345,956,599320,812,0001,998,0002,490,368
6Feb 2, 2026 22:4538,898344,972,894320,857,0001,999,0002,277,376
7Feb 2, 2026 22:4539,661352,578,928328,185,0001,000,0002,277,376
8Feb 2, 2026 22:4539,664349,954,166328,215,0001,000,0002,494,464
9Feb 2, 2026 22:4539,678358,659,413328,327,0001,000,0002,490,368