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 9, 2026 21:05Karthik ReddyKarthik ReddyScore: 3,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:073,2683,036,149,49426,003,0001,129,00020,480
2Oct 9, 2026 21:073,2743,036,231,19326,075,0001,106,00020,480
3Oct 9, 2026 21:073,2773,036,223,71026,125,0001,080,00020,480
4Oct 9, 2026 21:073,3163,037,197,13726,452,0001,076,00020,480
5Oct 9, 2026 21:073,3223,036,720,69726,553,0001,025,00020,480
6Oct 9, 2026 21:073,3233,037,854,43426,498,0001,086,00020,480
7Oct 9, 2026 21:073,3323,037,242,71626,574,0001,083,00020,480
8Oct 9, 2026 21:073,3543,036,888,19826,754,0001,092,00020,480
9Oct 9, 2026 21:073,3583,036,893,20626,760,0001,116,00020,480