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 listJun 30, 2026 18:32Genos0Genos0Score: 69,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 18:3269,146583,237,058514,496,00059,422,0002,113,536
2Jun 30, 2026 18:3269,210585,101,378514,784,00059,662,0002,113,536
3Jun 30, 2026 18:3269,211583,803,020515,087,00059,365,0002,113,536
4Jun 30, 2026 18:3269,234584,003,503514,897,00059,747,0002,113,536
5Jun 30, 2026 18:3269,245583,982,757514,842,00059,894,0002,113,536
6Jun 30, 2026 18:3269,247584,095,277514,823,00059,931,0002,113,536
7Jun 30, 2026 18:3269,249584,179,395515,374,00059,400,0002,113,536
8Jun 30, 2026 18:3269,280584,401,357515,216,00059,810,0002,113,536
9Jun 30, 2026 18:3269,383585,120,888515,629,00060,253,0002,113,536