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 listMar 14, 2026 19:03wnwnScore: 4,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 19:014,26861,547,07834,416,0001,012,0002,490,368
2Mar 14, 2026 19:034,27457,961,90834,463,0001,013,0002,273,280
3Mar 14, 2026 19:014,27657,869,58034,478,0001,014,0002,498,560
4Mar 14, 2026 19:034,27860,123,10934,495,0001,014,0002,273,280
5Mar 14, 2026 19:034,30558,622,05333,745,0001,985,0002,273,280
6Mar 14, 2026 19:014,31459,710,07533,821,0001,989,0002,273,280