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 listNov 6, 2025 20:39j3o1j3o1Score: 56,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2025 20:3956,277497,599,346466,102,0001,000,0002,519,040
2Nov 6, 2025 20:3956,283499,170,427466,151,0001,000,0002,260,992
3Nov 6, 2025 20:3956,283493,851,027466,152,0001,000,0002,260,992
4Nov 6, 2025 20:3956,285492,992,946466,166,0001,000,0002,260,992
5Nov 6, 2025 20:3956,287488,137,622466,182,0001,000,0002,260,992
6Nov 6, 2025 20:3956,291493,229,576467,217,00002,387,968
7Nov 6, 2025 20:3956,292493,695,013466,224,0001,000,0002,379,776
8Nov 6, 2025 20:3956,303492,367,403466,313,0001,000,0002,392,064
9Nov 6, 2025 20:3956,304494,100,799467,320,00002,519,040