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 listApr 21, 2026 01:28cashkarucashkaruScore: 70,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 01:2870,841612,453,600584,982,0002,999,0002,510,848
2Apr 21, 2026 01:2870,847610,386,147587,032,0001,000,0002,273,280
3Apr 21, 2026 01:2870,852616,607,402587,077,0001,000,0002,494,464
4Apr 21, 2026 01:2870,879616,533,781586,299,0002,001,0002,502,656
5Apr 21, 2026 01:2870,881616,559,980587,315,0001,000,0002,506,752
6Apr 21, 2026 01:2870,911613,458,968585,565,0002,997,0002,494,464
7Apr 21, 2026 01:2870,912611,506,645585,578,0002,997,0002,277,376
8Apr 21, 2026 01:2870,923611,467,793586,670,0001,998,0002,506,752
9Apr 21, 2026 01:2870,943603,518,468584,837,0003,998,0002,260,992