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 18, 2026 23:59Omkar SinghOmkar SinghScore: 528,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 00:00527,4934,387,467,7044,314,140,00064,052,0002,113,536
2Jun 19, 2026 00:00527,8834,390,753,7194,316,388,00065,044,0002,113,536
3Jun 19, 2026 00:00528,1384,392,886,6464,319,246,00064,305,0002,113,536
4Jun 19, 2026 00:00528,1434,392,963,4914,318,537,00065,055,0002,113,536
5Jun 19, 2026 00:00528,2764,393,982,3654,318,651,00066,043,0002,113,536
6Jun 19, 2026 00:00528,3234,394,603,8124,317,797,00067,285,0002,113,536
7Jun 19, 2026 00:00528,4574,395,731,2294,321,151,00065,044,0002,113,536
8Jun 19, 2026 00:00528,4724,395,632,9274,320,260,00066,059,0002,113,536
9Jun 19, 2026 00:00529,2764,402,331,7454,327,766,00065,233,0002,113,536