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 09:24Tan Lip WeiTan Lip WeiScore: 7,092Success
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 09:246,99384,230,49347,038,00011,008,0002,301,952
2Nov 2, 2025 09:247,04784,094,29750,558,0007,930,0002,314,240
3Nov 2, 2025 09:247,05588,417,78846,649,00011,910,0002,265,088
4Nov 2, 2025 09:247,06191,210,16951,652,0006,953,0002,269,184
5Nov 2, 2025 09:247,09284,560,60247,889,00010,974,0002,379,776
6Nov 2, 2025 09:247,12188,680,26347,084,00012,021,0002,363,392
7Nov 2, 2025 09:247,12384,445,24048,101,00011,023,0002,494,464
8Nov 2, 2025 09:247,17385,373,01048,437,00011,100,0002,383,872
9Nov 2, 2025 09:247,18685,894,24150,697,0008,946,0002,473,984