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 16:22triscacezar-droidtriscacezar-droidScore: 371,974Success
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 16:22371,2253,110,317,7233,000,213,00080,951,0002,289,664
2Nov 2, 2025 16:22371,7123,110,580,1513,018,246,00066,961,0002,289,664
3Nov 2, 2025 16:22371,7943,112,837,2143,019,938,00065,954,0002,506,752
4Nov 2, 2025 16:22371,9273,112,216,6512,994,057,00092,939,0002,289,664
5Nov 2, 2025 16:22371,9743,117,177,4453,003,426,00083,956,0002,506,752
6Nov 2, 2025 16:22372,0683,114,727,9763,017,205,00070,957,0002,289,664
7Nov 2, 2025 16:22373,0563,122,975,2913,021,402,00074,960,0002,281,472
8Nov 2, 2025 16:22376,2733,146,972,3363,048,114,00074,953,0002,285,568
9Nov 2, 2025 16:22381,6933,193,020,8993,097,098,00070,956,0002,347,008