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 1, 2025 23:05Jake LJake LScore: 394,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2025 23:05392,7803,287,182,2523,184,122,00075,955,0002,281,472
2Nov 1, 2025 23:05393,1443,289,148,3653,188,143,00074,956,0002,289,664
3Nov 1, 2025 23:05393,2613,294,434,1033,205,098,00058,965,0002,281,472
4Nov 1, 2025 23:05393,2613,290,130,1753,195,108,00068,959,0002,289,664
5Nov 1, 2025 23:05394,0073,295,192,3023,210,294,00059,968,0002,289,664
6Nov 1, 2025 23:05395,2433,312,750,6203,202,557,00077,964,0002,281,472
7Nov 1, 2025 23:05397,2033,324,867,5423,228,831,00067,954,0002,289,664
8Nov 1, 2025 23:05397,2733,323,495,5203,225,404,00071,964,0002,281,472
9Nov 1, 2025 23:05406,1973,398,432,4233,286,472,00084,960,0002,289,664