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 02:15FrederickFrederickScore: 16,390Success
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 02:1615,916143,294,675127,556,0004,555,0002,117,632
2Oct 5, 2026 02:1615,989143,243,241128,349,0004,362,0002,117,632
3Oct 5, 2026 02:1616,219145,783,935130,102,0004,518,0002,117,632
4Oct 5, 2026 02:1616,368147,106,476131,362,0004,500,0002,117,632
5Oct 5, 2026 02:1616,390146,423,959131,731,0004,308,0002,117,632
6Oct 5, 2026 02:1616,466147,783,628132,155,0004,521,0002,117,632
7Oct 5, 2026 02:1616,601159,215,779133,139,0004,657,0002,117,632
8Oct 5, 2026 02:1616,603148,212,996133,424,0004,381,0002,117,632
9Oct 5, 2026 02:1617,079152,184,601137,405,0004,351,0002,117,632