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 listMay 19, 2025 12:27Parinay ChauhanParinay ChauhanScore: 459,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2025 12:27458,9883,836,058,4353,743,642,00065,958,0002,281,472
2May 19, 2025 12:27458,9893,838,962,0463,717,642,00091,966,0002,281,472
3May 19, 2025 12:27459,0343,840,008,4033,725,027,00084,955,0002,289,664
4May 19, 2025 12:27459,1373,836,564,6333,736,878,00073,958,0002,281,472
5May 19, 2025 12:27459,4133,840,657,5383,751,156,00061,969,0002,510,848
6May 19, 2025 12:27460,1413,843,952,6153,759,197,00059,971,0002,289,664
7May 19, 2025 12:27460,7503,847,969,8793,745,258,00078,963,0002,289,664
8May 19, 2025 12:27465,0593,887,435,4523,779,030,00080,957,0002,281,472
9May 19, 2025 12:27467,7553,912,732,5133,820,408,00061,957,0002,281,472