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 listMar 16, 2026 13:49Eric CeglieEric CeglieScore: 8,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 13:498,82196,324,03970,206,0003,008,0002,502,656
2Mar 16, 2026 13:498,83098,956,27470,278,0003,011,0002,506,752
3Mar 16, 2026 13:498,845101,736,77971,401,0002,011,0002,289,664
4Mar 16, 2026 13:498,92498,951,60272,069,0002,001,0002,506,752
5Mar 16, 2026 13:498,92695,592,75172,086,0002,002,0002,289,664
6Mar 16, 2026 13:498,951103,276,96172,288,0002,008,0002,498,560