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 listNov 2, 2025 09:43Tan Lip WeiTan Lip WeiScore: 9,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 09:438,992104,276,04263,690,00010,946,0002,502,656
2Nov 2, 2025 09:439,00699,773,78363,786,00010,963,0002,269,184
3Nov 2, 2025 09:439,206107,039,32264,502,00011,908,0002,379,776
4Nov 2, 2025 09:439,23199,296,01864,678,00011,940,0002,506,752
5Nov 2, 2025 09:439,383107,867,77364,902,00012,980,0002,461,696
6Nov 2, 2025 09:439,461103,800,74865,603,00012,921,0002,387,968