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 8, 2026 20:04Victor MerckléVictor MerckléScore: 4,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 20:054,57045,657,72836,863,0001,074,0002,113,536
2Jun 8, 2026 20:054,58145,760,72836,952,0001,077,0002,113,536
3Jun 8, 2026 20:054,58345,743,51636,943,0001,100,0002,113,536
4Jun 8, 2026 20:054,59746,064,33437,098,0001,062,0002,113,536
5Jun 8, 2026 20:054,60545,885,37337,198,0001,026,0002,113,536
6Jun 8, 2026 20:054,60845,729,76137,233,0001,017,0002,113,536
7Jun 8, 2026 20:054,61546,057,24737,254,0001,055,0002,113,536
8Jun 8, 2026 20:054,63446,216,36437,436,0001,028,0002,113,536
9Jun 8, 2026 20:054,64446,243,37637,471,0001,078,0002,113,536