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:36Victor MerckléVictor MerckléScore: 4,567Success
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:374,54745,349,61036,668,0001,073,0002,113,536
2Jun 10, 2026 11:374,55145,605,61036,706,0001,071,0002,113,536
3Jun 10, 2026 11:374,55545,411,20336,729,0001,081,0002,113,536
4Jun 10, 2026 11:374,56345,869,41636,794,0001,084,0002,113,536
5Jun 10, 2026 11:374,56745,460,96936,872,0001,038,0002,113,536
6Jun 10, 2026 11:374,59245,773,52137,042,0001,077,0002,113,536
7Jun 10, 2026 11:374,75647,101,58438,405,0001,072,0002,113,536
8Jun 10, 2026 11:374,76047,113,58938,446,0001,064,0002,113,536
9Jun 10, 2026 11:374,77347,011,39238,563,0001,060,0002,113,536