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 listJun 10, 2026 11:00Victor MerckléVictor MerckléScore: 5,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 11:015,34651,779,94443,280,0001,097,0002,113,536
2Jun 10, 2026 11:015,35151,762,26043,350,0001,065,0002,113,536
3Jun 10, 2026 11:015,37252,026,99543,566,0001,023,0002,113,536
4Jun 10, 2026 11:015,38952,107,79643,720,0001,011,0002,113,536
5Jun 10, 2026 11:015,50753,333,58144,701,0001,010,0002,113,536
6Jun 10, 2026 11:015,57653,896,16045,252,0001,035,0002,113,536
7Jun 10, 2026 11:015,58554,298,44445,304,0001,059,0002,113,536
8Jun 10, 2026 11:015,59754,106,16045,432,0001,028,0002,113,536
9Jun 10, 2026 11:015,62154,235,78045,630,0001,027,0002,113,536