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 listAug 21, 2025 20:13Adam FolwarcznyAdam FolwarcznyScore: 19,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 20:1319,254186,583,711157,808,0001,997,0002,269,184
2Aug 21, 2025 20:1319,257180,017,273157,838,0001,997,0002,269,184
3Aug 21, 2025 20:1319,258180,790,845157,841,0001,997,0002,531,328
4Aug 21, 2025 20:1319,263188,579,850157,883,0001,998,0002,531,328
5Aug 21, 2025 20:1319,267181,535,801157,914,0001,998,0002,531,328
6Aug 21, 2025 20:1319,275181,510,632157,984,0001,999,0002,531,328
7Aug 21, 2025 20:1319,280188,634,498158,022,0002,000,0002,531,328
8Aug 21, 2025 20:1319,298183,980,635159,170,0001,001,0002,437,120
9Aug 21, 2025 20:1319,314184,576,638159,306,0001,001,0002,437,120