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 listOct 2, 2026 06:31Karthik ReddyKarthik ReddyScore: 3,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 06:333,3273,036,712,48227,621,000020,480
2Oct 2, 2026 06:333,3313,036,682,91327,653,000020,480
3Oct 2, 2026 06:333,3333,036,658,24027,671,000020,480
4Oct 2, 2026 06:333,3363,036,803,88427,689,000020,480
5Oct 2, 2026 06:333,3373,036,854,94027,699,000020,480
6Oct 2, 2026 06:333,3393,036,824,44427,718,000020,480
7Oct 2, 2026 06:333,3523,036,763,41426,735,0001,094,00020,480
8Oct 2, 2026 06:333,3653,037,049,67026,830,0001,100,00020,480
9Oct 2, 2026 06:333,3723,044,593,81227,993,000020,480