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 listMar 15, 2026 08:46eldon-chungeldon-chungScore: 39,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 08:4639,551352,301,053327,276,0001,000,0002,285,568
2Mar 15, 2026 08:4639,553349,692,280328,291,00002,285,568
3Mar 15, 2026 08:4639,555353,243,476327,308,0001,000,0002,260,992
4Mar 15, 2026 08:4639,563351,608,121327,374,0001,001,0002,269,184
5Mar 15, 2026 08:4639,567355,265,716327,408,0001,001,0002,273,280
6Mar 15, 2026 08:4639,572356,832,038327,445,0001,001,0002,285,568
7Mar 15, 2026 08:4639,573356,873,302327,459,0001,001,0002,260,992
8Mar 15, 2026 08:4639,588358,482,759327,583,000998,0002,265,088
9Mar 15, 2026 08:4639,589355,762,039326,593,0001,997,0002,277,376
10Mar 15, 2026 08:4639,592357,520,928326,618,0001,997,0002,277,376
11Mar 15, 2026 08:4639,592360,598,932326,617,0001,997,0002,285,568
12Mar 15, 2026 08:4639,600348,790,237326,681,0001,998,0002,273,280