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 listSep 30, 2026 19:57Karthik ReddyKarthik ReddyScore: 3,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 19:583,44138,014,06627,413,0001,155,0002,113,536
2Sep 30, 2026 19:583,44837,997,32327,466,0001,157,0002,113,536
3Sep 30, 2026 19:583,44937,526,05727,471,0001,156,0002,113,536
4Sep 30, 2026 19:583,45237,586,54727,482,0001,173,0002,113,536
5Sep 30, 2026 19:583,45437,478,77627,497,0001,178,0002,113,536
6Sep 30, 2026 19:583,45737,619,42427,518,0001,176,0002,113,536
7Sep 30, 2026 19:583,45937,736,11827,695,0001,021,0002,113,536
8Sep 30, 2026 19:583,46137,600,65927,562,0001,169,0002,113,536
9Sep 30, 2026 19:583,46537,698,00927,601,0001,164,0002,113,536