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 27, 2026 16:12Victor MerckléVictor MerckléScore: 4,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 16:134,16442,315,52833,441,0001,123,0002,113,536
2Jun 27, 2026 16:134,16642,137,81033,450,0001,130,0002,113,536
3Jun 27, 2026 16:134,18142,190,36633,600,0001,107,0002,113,536
4Jun 27, 2026 16:134,19143,830,02333,666,0001,123,0002,113,536
5Jun 27, 2026 16:134,20142,622,33233,748,0001,124,0002,113,536
6Jun 27, 2026 16:134,33443,697,32234,837,0001,143,0002,113,536
7Jun 27, 2026 16:134,37143,936,16235,176,0001,111,0002,113,536
8Jun 27, 2026 16:134,41244,305,67335,575,0001,050,0002,113,536
9Jun 27, 2026 16:134,44344,563,72935,774,0001,110,0002,113,536