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 listOct 15, 2026 02:42zayd-ansari-codezayd-ansari-codeScore: 87,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 02:4386,900731,785,735662,446,00058,824,0002,113,536
2Oct 15, 2026 02:4386,982732,392,237662,864,00059,093,0002,113,536
3Oct 15, 2026 02:4386,989733,072,124663,300,00058,714,0002,113,536
4Oct 15, 2026 02:4387,017732,678,529663,870,00058,377,0002,113,536
5Oct 15, 2026 02:4387,025732,766,919663,420,00058,891,0002,113,536
6Oct 15, 2026 02:4387,066733,609,466663,694,00058,959,0002,113,536
7Oct 15, 2026 02:4387,072733,815,047664,057,00058,647,0002,113,536
8Oct 15, 2026 02:4387,093734,665,136663,731,00059,147,0002,113,536
9Oct 15, 2026 02:4387,139733,744,372663,953,00059,301,0002,113,536