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 listMay 13, 2026 18:02M-RochatM-RochatScore: 19,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:0319,577171,349,518161,433,0001,058,0002,113,536
2May 13, 2026 18:0319,595173,117,046161,611,0001,028,0002,113,536
3May 13, 2026 18:0319,637172,790,399161,966,0001,025,0002,113,536
4May 13, 2026 18:0319,670172,971,391162,218,0001,043,0002,113,536
5May 13, 2026 18:0319,691172,181,958162,408,0001,029,0002,113,536
6May 13, 2026 18:0319,712172,418,085162,604,0001,012,0002,113,536
7May 13, 2026 18:0319,921174,112,020164,321,0001,031,0002,113,536
8May 13, 2026 18:0320,096175,942,142165,753,0001,050,0002,113,536
9May 13, 2026 18:0320,204176,372,188166,673,0001,021,0002,113,536