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:28triscacezar-droidtriscacezar-droidScore: 430,161Success
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:28429,9303,594,716,0143,493,455,00074,966,0002,510,848
2Nov 2, 2025 16:28430,1613,592,833,6023,497,368,00072,965,0002,506,752
3Nov 2, 2025 16:28440,5713,680,008,5503,579,786,00076,952,0002,281,472