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 listSep 25, 2026 03:28Karthik ReddyKarthik ReddyScore: 9,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 03:289,16086,215,96575,020,0001,011,0002,113,536
2Sep 25, 2026 03:289,25787,064,24775,824,0001,012,0002,113,536
3Sep 25, 2026 03:289,26387,194,98575,872,0001,011,0002,113,536
4Sep 25, 2026 03:289,26587,125,78975,890,0001,010,0002,113,536
5Sep 25, 2026 03:289,27187,286,15075,947,0001,010,0002,113,536
6Sep 25, 2026 03:289,29487,415,66076,133,0001,010,0002,113,536
7Sep 25, 2026 03:289,38888,280,27376,911,0001,010,0002,113,536
8Sep 25, 2026 03:289,44388,820,66777,372,0001,010,0002,113,536
9Sep 25, 2026 03:289,52589,341,75278,050,0001,009,0002,113,536