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 31, 2026 22:20TonyTonyScore: 54,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 22:2054,334460,974,819391,941,00059,038,0002,113,536
2Jul 31, 2026 22:2054,345460,954,237391,967,00059,099,0002,113,536
3Jul 31, 2026 22:2054,394461,521,881392,045,00059,431,0002,113,536
4Jul 31, 2026 22:2054,398461,465,644391,982,00059,527,0002,113,536
5Jul 31, 2026 22:2054,403461,528,144392,005,00059,545,0002,113,536
6Jul 31, 2026 22:2054,408462,341,313392,287,00059,300,0002,113,536
7Jul 31, 2026 22:2054,418461,671,816391,975,00059,699,0002,113,536
8Jul 31, 2026 22:2054,451461,827,475392,031,00059,916,0002,113,536
9Jul 31, 2026 22:2054,452461,980,107392,178,00059,777,0002,113,536