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 listSep 17, 2026 02:59Andrew EpsteinAndrew EpsteinScore: 3,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:593,36436,651,69926,861,0001,064,0002,113,536
2Sep 17, 2026 02:593,36436,702,12326,834,0001,090,0002,113,536
3Sep 17, 2026 02:593,40636,963,27127,249,0001,025,0002,113,536
4Sep 17, 2026 02:593,43537,165,76327,477,0001,034,0002,113,536
5Sep 17, 2026 02:593,44037,250,38427,522,0001,037,0002,113,536
6Sep 17, 2026 02:593,46837,465,05227,734,0001,052,0002,113,536
7Sep 17, 2026 02:593,49637,695,17827,984,0001,034,0002,113,536
8Sep 17, 2026 02:593,51438,492,27728,158,0001,014,0002,113,536
9Sep 17, 2026 02:593,52237,995,47228,222,0001,011,0002,113,536