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 24, 2025 11:02Jeffrey JianJeffrey JianScore: 142,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2025 11:02142,3131,209,020,6881,101,255,00079,945,0002,285,568
2Nov 24, 2025 11:02142,3461,208,664,7761,101,509,00079,964,0002,269,184
3Nov 24, 2025 11:02142,3811,205,679,8841,114,776,00066,986,0002,260,992
4Nov 24, 2025 11:02142,3861,204,135,1181,115,816,00065,989,0002,269,184
5Nov 24, 2025 11:02142,3871,203,956,9961,116,827,00064,989,0002,269,184
6Nov 24, 2025 11:02142,4021,210,927,9641,113,944,00067,996,0002,269,184
7Nov 24, 2025 11:02142,4131,208,317,9031,111,088,00070,941,0002,269,184
8Nov 24, 2025 11:02142,4971,207,542,5901,107,747,00074,982,0002,498,560
9Nov 24, 2025 11:02152,6121,290,548,9621,205,695,00060,984,0002,371,584