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 2, 2025 16:06triscacezar-droidtriscacezar-droidScore: 1,987,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 16:061,982,93216,489,147,67916,395,370,00062,966,0002,277,376
2Nov 2, 2025 16:061,983,90216,501,071,39316,398,418,00067,968,0002,277,376
3Nov 2, 2025 16:061,984,78316,504,811,70116,393,744,00079,954,0002,277,376
4Nov 2, 2025 16:061,986,90016,520,943,21716,437,303,00053,971,0002,265,088
5Nov 2, 2025 16:061,987,56716,532,954,87116,440,831,00055,972,0002,285,568
6Nov 2, 2025 16:061,987,57916,528,705,43516,430,933,00065,971,0002,289,664
7Nov 2, 2025 16:061,989,38416,549,507,33816,433,930,00077,961,0002,285,568
8Nov 2, 2025 16:061,990,16616,552,831,88116,439,422,00078,958,0002,289,664
9Nov 2, 2025 16:061,997,87816,615,445,14416,495,424,00086,960,0002,285,568