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 listJul 13, 2026 08:36limanjun99limanjun99Score: 4,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 08:364,27445,140,65633,235,0002,243,0002,113,536
2Jul 13, 2026 08:364,28545,236,44933,375,0002,197,0002,113,536
3Jul 13, 2026 08:364,30945,381,96233,510,0002,257,0002,113,536
4Jul 13, 2026 08:364,31446,004,78232,532,0003,282,0002,113,536
5Jul 13, 2026 08:364,32046,204,17733,511,0002,347,0002,113,536
6Jul 13, 2026 08:364,32845,657,15132,664,0003,266,0002,113,536
7Jul 13, 2026 08:364,34746,401,61732,793,0003,291,0002,113,536
8Jul 13, 2026 08:364,37146,538,63333,000,0003,281,0002,113,536
9Jul 13, 2026 08:364,37646,064,30333,081,0003,244,0002,113,536