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 listJan 31, 2026 11:48olliecrowolliecrowScore: 6,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 11:486,36376,431,94648,828,0003,986,0002,408,448
2Jan 31, 2026 11:486,37679,668,28348,925,0003,993,0002,408,448
3Jan 31, 2026 11:486,42381,832,98450,298,0003,017,0002,314,240
4Jan 31, 2026 11:486,66780,316,16350,304,0005,030,0002,318,336
5Jan 31, 2026 11:486,69281,960,81152,515,0003,029,0002,416,640
6Jan 31, 2026 11:486,72181,549,15653,756,0002,028,0002,510,848
7Jan 31, 2026 11:486,72385,180,28552,809,0002,989,0002,342,912
8Jan 31, 2026 11:486,72387,239,04851,814,0003,985,0002,428,928
9Jan 31, 2026 11:486,72383,568,85054,804,000996,0002,420,736
10Jan 31, 2026 11:486,74083,933,16952,946,0002,996,0002,510,848
11Jan 31, 2026 11:486,75782,958,91554,080,0002,002,0002,301,952
12Jan 31, 2026 11:486,78585,474,84053,302,0003,017,0002,449,408