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 listOct 23, 2026 10:58C21C21Score: 11,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2026 10:5911,558106,822,55994,753,0001,181,0002,113,536
2Oct 23, 2026 10:5911,560106,863,09094,757,0001,192,0002,113,536
3Oct 23, 2026 10:5911,564106,976,25494,814,0001,173,0002,113,536
4Oct 23, 2026 10:5911,572107,038,49894,883,0001,172,0002,113,536
5Oct 23, 2026 10:5911,575106,975,88495,068,0001,012,0002,113,536
6Oct 23, 2026 10:5911,578107,037,87894,918,0001,182,0002,113,536
7Oct 23, 2026 10:5911,583115,437,30494,942,0001,200,0002,117,632
8Oct 23, 2026 10:5911,593107,110,91995,055,0001,170,0002,113,536
9Oct 23, 2026 10:5911,594107,150,27895,070,0001,167,0002,113,536