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 5, 2026 01:44FrederickFrederickScore: 8,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 01:458,59584,041,88869,269,0002,077,0002,117,632
2Oct 5, 2026 01:458,68583,001,88070,003,0002,089,0002,117,632
3Oct 5, 2026 01:458,76883,311,30270,704,0002,074,0002,117,632
4Oct 5, 2026 01:458,79584,090,06770,941,0002,065,0002,117,632
5Oct 5, 2026 01:458,79884,206,38470,955,0002,075,0002,117,632
6Oct 5, 2026 01:458,87084,027,49671,562,0002,066,0002,117,632
7Oct 5, 2026 01:458,99985,264,99772,625,0002,071,0002,117,632
8Oct 5, 2026 01:459,03486,174,36072,905,0002,078,0002,117,632
9Oct 5, 2026 01:459,13886,588,20573,751,0002,098,0002,117,632