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 4, 2025 04:19Tejas G.Tejas G.Score: 10,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 04:199,756108,334,09878,975,0001,999,0002,285,568
2Nov 4, 2025 04:199,813106,876,36980,441,0001,005,0002,285,568
3Nov 4, 2025 04:1910,003108,421,37182,028,0001,000,0002,285,568
4Nov 4, 2025 04:1910,012103,615,98681,099,0002,002,0002,347,008
5Nov 4, 2025 04:1910,013104,439,16781,104,0002,002,0002,285,568
6Nov 4, 2025 04:1910,129109,173,63083,070,0001,000,0002,510,848