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 30, 2026 23:47Victor MerckléVictor MerckléScore: 4,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 23:484,69846,834,77537,853,0001,143,0002,117,632stderr
2Jun 30, 2026 23:484,70146,781,42737,900,0001,124,0002,117,632stderr
3Jun 30, 2026 23:484,70346,750,91138,010,0001,026,0002,117,632stderr
4Jun 30, 2026 23:484,70746,829,43638,039,0001,033,0002,117,632stderr
5Jun 30, 2026 23:484,70846,821,73938,038,0001,043,0002,117,632stderr
6Jun 30, 2026 23:484,71246,880,03038,090,0001,021,0002,117,632stderr
7Jun 30, 2026 23:484,71846,841,22338,032,0001,132,0002,117,632stderr
8Jun 30, 2026 23:484,72547,073,11838,083,0001,141,0002,117,632stderr
9Jun 30, 2026 23:484,75047,176,55338,327,0001,105,0002,117,632stderr