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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 16:544,03041,786,88131,310,0002,147,0002,113,536
2Aug 27, 2026 16:544,03742,068,38331,398,0002,113,0002,113,536
3Aug 27, 2026 16:544,03741,829,68331,438,0002,074,0002,113,536
4Aug 27, 2026 16:544,04142,619,93031,376,0002,171,0002,113,536
5Aug 27, 2026 16:544,09942,175,69531,873,0002,154,0002,113,536
6Aug 27, 2026 16:544,10642,488,36931,878,0002,203,0002,113,536
7Aug 27, 2026 16:544,23244,160,38433,031,0002,102,0002,113,536
8Aug 27, 2026 16:544,30644,088,21733,704,0002,038,0002,113,536
9Aug 27, 2026 16:544,31162,196,10533,561,0002,225,0002,113,536