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 5, 2026 10:53chereshnya123chereshnya123Score: 157,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 10:53157,1921,313,695,7091,241,599,00063,101,0002,113,536
2Jun 5, 2026 10:53157,7531,318,529,7401,245,269,00064,087,0002,113,536
3Jun 5, 2026 10:53157,8061,318,850,1421,245,713,00064,082,0002,113,536
4Jun 5, 2026 10:53157,8141,319,620,1271,245,782,00064,076,0002,113,536
5Jun 5, 2026 10:53157,8921,319,559,2801,247,423,00063,085,0002,113,536
6Jun 5, 2026 10:53158,1071,321,362,7281,246,213,00066,083,0002,113,536
7Jun 5, 2026 10:53158,2101,322,395,8541,249,042,00064,106,0002,113,536
8Jun 5, 2026 10:53158,5221,324,932,8871,250,660,00065,077,0002,113,536
9Jun 5, 2026 10:53158,6331,325,768,9811,251,577,00065,078,0002,113,536