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 24, 2025 15:10Foo Chuan Le, NicholasFoo Chuan Le, NicholasScore: 1,830,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2025 15:101,830,20815,225,666,89015,113,762,00076,968,0002,277,376
2Mar 24, 2025 15:101,830,20915,219,414,12615,112,776,00077,962,0002,277,376
3Mar 24, 2025 15:101,832,00115,235,112,28615,139,635,00065,972,0002,277,376