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 listJan 16, 2025 10:40ttmxttmxScore: 993,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 10:40986,6638,224,796,0878,114,348,00074,957,0002,355,200
2Jan 16, 2025 10:40988,9548,238,634,2858,131,351,00076,965,0002,281,472
3Jan 16, 2025 10:40989,1418,237,907,7018,128,912,00080,959,0002,293,760
4Jan 16, 2025 10:40990,1628,250,774,4178,146,379,00071,968,0002,281,472
5Jan 16, 2025 10:40993,4318,270,929,2328,158,514,00086,962,0002,363,392
6Jan 16, 2025 10:40993,4318,282,988,2298,168,521,00076,957,0002,281,472
7Jan 16, 2025 10:40993,5768,276,824,9538,171,718,00074,960,0002,289,664
8Jan 16, 2025 10:401,006,1968,382,562,2048,269,459,00081,964,0002,281,472
9Jan 16, 2025 10:401,025,1638,536,888,0888,424,898,00083,959,0002,281,472