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 4, 2026 23:00FrederickFrederickScore: 20,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 4, 2026 23:0020,776183,645,436113,343,00059,098,0002,113,536
2Oct 4, 2026 23:0020,778182,879,263114,161,00058,298,0002,113,536
3Oct 4, 2026 23:0020,778183,672,430113,371,00059,089,0002,113,536
4Oct 4, 2026 23:0020,785183,777,237113,448,00059,068,0002,113,536
5Oct 4, 2026 23:0020,791183,763,713113,440,00059,132,0002,113,536
6Oct 4, 2026 23:0020,808183,962,251113,464,00059,248,0002,113,536
7Oct 4, 2026 23:0020,850184,245,940113,474,00059,589,0002,113,536
8Oct 4, 2026 23:0020,861184,368,167113,535,00059,616,0002,113,536
9Oct 4, 2026 23:0020,998185,441,191114,368,00059,923,0002,113,536