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 1, 2025 19:11Rajarshi BasuRajarshi BasuScore: 12,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2025 19:1112,119125,602,50499,582,0001,005,0002,289,664
2Dec 1, 2025 19:1112,122128,129,33299,606,0001,006,0002,289,664
3Dec 1, 2025 19:1112,123127,285,326100,623,00002,289,664
4Dec 1, 2025 19:1112,131124,234,36397,696,0002,990,0002,289,664
5Dec 1, 2025 19:1112,137126,378,85398,747,0001,994,0002,379,776
6Dec 1, 2025 19:1112,140128,221,63899,761,000997,0002,281,472
7Dec 1, 2025 19:1112,140132,960,254100,760,00002,387,968
8Dec 1, 2025 19:1112,143125,635,41798,790,0001,995,0002,383,872
9Dec 1, 2025 19:1112,160136,359,35997,934,0002,997,0002,289,664