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 listDec 9, 2025 11:02Gunsoo KimGunsoo KimScore: 59,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 11:0259,229518,090,276490,600,000999,0002,269,184
2Dec 9, 2025 11:0259,230519,794,954489,609,0001,998,0002,289,664
3Dec 9, 2025 11:0259,243519,462,195489,718,0001,998,0002,527,232
4Dec 9, 2025 11:0259,252524,981,366489,792,0001,999,0002,289,664
5Dec 9, 2025 11:0259,259523,766,809489,850,0001,999,0002,289,664
6Dec 9, 2025 11:0259,261517,851,418489,865,0001,999,0002,519,040
7Dec 9, 2025 11:0259,299515,226,327491,178,0001,000,0002,289,664
8Dec 9, 2025 11:0259,362524,887,564490,707,0001,998,0002,285,568
9Dec 9, 2025 11:0259,538523,095,086491,164,0003,001,0002,289,664