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 listSep 6, 2026 10:35Kevin HeaveyKevin HeaveyScore: 3,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:363,55039,452,51828,293,0001,172,0002,113,536
2Sep 6, 2026 10:363,57439,713,66428,618,0001,047,0002,113,536
3Sep 6, 2026 10:363,57439,730,51428,490,0001,175,0002,113,536
4Sep 6, 2026 10:363,58139,781,16028,583,0001,142,0002,113,536
5Sep 6, 2026 10:363,58939,910,82928,600,0001,194,0002,113,536
6Sep 6, 2026 10:363,64640,277,10329,098,0001,168,0002,117,632
7Sep 6, 2026 10:363,69040,641,01529,493,0001,135,0002,113,536
8Sep 6, 2026 10:363,84842,078,94930,806,0001,137,0002,113,536
9Sep 6, 2026 10:363,87342,230,66230,991,0001,156,0002,113,536