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 listMay 24, 2026 17:18Victor MerckléVictor MerckléScore: 4,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 17:194,87749,004,33339,427,0001,056,0002,113,536
2May 24, 2026 17:194,87751,162,52939,417,0001,070,0002,113,536
3May 24, 2026 17:194,88450,130,59539,463,0001,079,0002,113,536
4May 24, 2026 17:194,88548,475,47339,479,0001,073,0002,113,536
5May 24, 2026 17:194,88748,387,39039,492,0001,073,0002,113,536
6May 24, 2026 17:194,89350,059,66739,579,0001,038,0002,113,536
7May 24, 2026 17:194,90148,949,43439,621,0001,061,0002,113,536
8May 24, 2026 17:194,90248,781,51439,597,0001,090,0002,113,536
9May 24, 2026 17:194,91248,526,69939,712,0001,063,0002,113,536