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 25, 2026 16:50Kenzie_RTKenzie_RTScore: 46,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:5046,725400,059,413386,776,0001,046,0002,113,536
2May 25, 2026 16:5046,737397,160,481386,819,0001,101,0002,113,536
3May 25, 2026 16:5046,799398,565,652387,366,0001,073,0002,113,536
4May 25, 2026 16:5046,837398,127,859387,747,0001,003,0002,113,536
5May 25, 2026 16:5046,845399,898,035387,772,0001,049,0002,113,536
6May 25, 2026 16:5046,888401,387,968388,174,0001,004,0002,113,536
7May 25, 2026 16:5046,930401,466,805388,432,0001,089,0002,113,536
8May 25, 2026 16:5046,967401,603,331388,817,0001,010,0002,113,536
9May 25, 2026 16:5047,077400,100,428389,737,0001,004,0002,113,536