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 1, 2026 19:52TonyTonyScore: 62,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 19:5262,308527,480,361454,358,00062,799,0002,113,536
2Aug 1, 2026 19:5262,327527,480,199454,632,00062,688,0002,113,536
3Aug 1, 2026 19:5262,341528,326,928453,811,00063,622,0002,113,536
4Aug 1, 2026 19:5262,346528,392,830454,836,00062,637,0002,113,536
5Aug 1, 2026 19:5262,365527,769,661454,536,00063,097,0002,113,536
6Aug 1, 2026 19:5262,401528,789,799454,349,00063,581,0002,113,536
7Aug 1, 2026 19:5262,416528,114,680454,570,00063,483,0002,113,536
8Aug 1, 2026 19:5262,429529,740,901455,394,00062,768,0002,113,536
9Aug 1, 2026 19:5262,501529,653,602454,271,00064,488,0002,113,536