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 7, 2026 22:32zemledelzemledelScore: 71,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 22:3371,407602,286,808512,736,00079,944,0002,113,536
2Jul 7, 2026 22:3371,441602,542,217512,468,00080,495,0002,113,536
3Jul 7, 2026 22:3371,825605,592,370513,172,00082,982,0002,113,536
4Jul 7, 2026 22:3371,847605,808,757513,587,00082,748,0002,113,536
5Jul 7, 2026 22:3371,869606,105,164513,600,00082,915,0002,113,536
6Jul 7, 2026 22:3371,887606,167,165513,642,00083,021,0002,113,536
7Jul 7, 2026 22:3371,916606,329,032513,613,00083,296,0002,113,536
8Jul 7, 2026 22:3371,938606,661,281516,960,00080,128,0002,113,536
9Jul 7, 2026 22:3371,970606,868,478514,551,00082,803,0002,113,536